A PARALLEL CLUSTER LABELING METHOD FOR MONTE CARLO DYNAMICS
نویسندگان
چکیده
منابع مشابه
Parallel Cluster Labeling for Large-Scale Monte Carlo Simulations
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with large numbers of processors. The algorithm divides physical space into rectangular cells which are assigned to processors and combines a serial local labeling p...
متن کاملar X iv : h ep - l at / 9 20 80 03 v 2 5 A ug 1 99 2 . A PARALLEL CLUSTER LABELING METHOD FOR MONTE CARLO DYNAMICS
We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processing nodes. The method divides physical space into rectangular cells which are assigned to processing nodes and combines a serial procedure, by which clusters are labeled locally inside each cell, with a nearest neighbor relaxation process in which processing...
متن کاملMonte Carlo Simulations of Globular Cluster Dynamics
We have developed a new parallel supercomputer code based on Hénon’s Monte Carlo method for simulating the dynamical evolution of globular clusters. This new code allows us to calculate the evolution of a cluster containing a realistic number of stars (N ∼ 10 − 10) in about a day of computing time. The discrete, star-by-star representation of the cluster in the simulation allows us to treat nat...
متن کاملA Parallel Quasi-Monte Carlo Method for Computing Extremal Eigenvalues
1 Florida State University, Department of Computer Science, Tallahassee, FL 32306-4530, USA 2 Bulgarian Academy of Sciences, Central Laboratory for Parallel Processing, 1113 Sofia, Bulgaria Abstract The convergence of Monte Carlo methods for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers known as quasirandom numbers (...
متن کاملA New Method for Parallel Monte Carlo Tree Search
In recent years there has been much interest in the Monte Carlo tree search algorithm, a new, adaptive, randomized optimization algorithm. In fields as diverse as Artificial Intelligence, Operations Research, and High Energy Physics, research has established that Monte Carlo tree search can find good solutions without domain dependent heuristics. However, practice shows that reaching high perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 1992
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183192000853